منابع مشابه
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem
Consider a system of two polynomial equations in two variables: F (X,Y ) = G(X, Y ) = 0 where F ∈ R[X,Y ] has degree d ≥ 1 and G ∈ R[X,Y ] has t monomials. We show that the system has only O(dt + dt) real solutions when it has a finite number of real solutions. This is the first polynomial bound for this problem. In particular, the bounds coming from the theory of fewnomials are exponential in ...
متن کاملThe Real Story of the Fifth Nerve Neurinoma: A Review of Our Learning Curve about Surgical Approaches and Associated Shortcomings
Background and Importance: Our learning curve during two decades of neurosurgical practice has been changed from an abstractive to a more meaningful and conductive state. In cases of fifth nerve neurinoma, pre-operative anatomopathologic diagnosis could lead us to a pre-planned program during and after the surgery to get the safe surgical result. Case Presentation: Representation of two comp...
متن کاملBig Hits
T here aren't many sports articles in the journal Science, so it was with great interest that I read " A Late Hit for Pro-Football Players " by Greg Miller (www. sciencemag.org). 3 This article is a very interesting compilation of recent research and developments in the area of sports-related concussion. The article highlights the efforts of Chris Nowinski, a former Harvard football standout wh...
متن کاملHITS and Misses: Combining BM25 with HITS for Expert Search
This paper describes the participation of Dublin City University in the CriES (Cross-Lingual Expert Search) pilot challenge. To realize expert search, we combine traditional information retrieval (IR) using the BM25 model with reranking of results using the HITS algorithm. The experiments were performed on two indexes, one containing all questions and one containing all answers. Two runs were s...
متن کاملA Method for Accelerating the HITS Algorithm
We present a new method to accelerate the HITS algorithm by exploiting hyperlink structure of the web graph. The proposed algorithm extends the idea of authority and hub scores from HITS by introducing two diagonal matrices which contain constants that act as weights to make authority pages more authoritative and hub pages more hubby. This method works because in the web graph good authorities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2010
ISSN: 0028-0836,1476-4687
DOI: 10.1038/464681b